Shape - based Image Retrieval Using Geometric Hashing
نویسندگان
چکیده
We present a general strategy for shape-based image retrieval which considers similarity modulo a given transformation group G. The shape content of an image is summarized by recording what geometric primitives, such as line segments and circular arcs, t where in the image. Geometric hashing is used to compute a set of primitive features which are invariant under a G-transformation of the image. Our search engine is feature-based in the sense that similarity is determined by looping over the features in the query and asking: Which database images have features that are close to a given query feature? The most similar database images are ones that have many features which are close to query features. We apply our approach to an example database of 500 chinese character bitmaps.
منابع مشابه
Efficient and Effective Similar Shape Retrieval
In this paper, we present the design and implementation of a content-based retrieval system which achieves efficient and effective similar shape retrieval using a modified geometric hashing technique. The system contains four main components: a feature acquisition module, a query manager, a search engine, and a hash table. The hash table houses the feature information. The query manager accepts...
متن کاملContent-Based Image Retrieval by Interest Points Matching and Geometric Hashing
This paper presents a content-based image retrieval technique based on interest points matching and geometric hashing. We estimate points with significant luminance variations as interest points. A small region around the interest point is located as an image patch. Low-level features are extracted to describe each image patch. To provide geometric invariant image matching, we index the image p...
متن کاملSimilarity-Preserving Binary Hashing for Image Retrieval in large databases
Hashing techniques have become very popular to solve the content-based image retrieval problem in gigantic image databases because they allow to represent feature vectors using compact binary codes. Binary codes provide speed and are memory-efficient. Different approaches have been taken by researchers, some of them based on the Spectral Hashing objective function, among these the recently prop...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملCompressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997